Differential in infrastructure networks

Let G = ( V, E ) be a graph of order n and let B D the set vertices in V \ that have neighbor vertex . The differential is defined as ∂ |B(D)| − |D| maximum value for any subset A said to dominating if every adjacent dominant it contains -set which also set. This paper devoted computation wheel, cycle path-related graphs infrastructure networks. Furthermore, types networks are recognized.